Improvements to the Sliding Discrete Fourier Transform Algorithm [Tips & Tricks]

This article presents two networks that improve upon the behavior and performance of previously published sliding discrete Fourier transform (SDFT) algorithms. The proposed are structurally simple, computationally efficient, guaranteed stable used for real-time spectrum analysis. first network computes one spectral output sample, equal to a single-bin an N-point DFT, each input signal sample. second is frequency flexible, in its analysis can be any scalar value range zero one-half data sample rate measured cycles per second.